MCFsyn: A Multi-Party Set Reconciliation Protocol With the Marked Cuckoo Filter
نویسندگان
چکیده
Multi-party set reconciliation is a key component in distributed and networking systems. It naturally contains two dimensions, i.e., representation protocol. However, existing sketch data structures are insufficient to satisfy the new needs brought by multi-party scenario simultaneously, including space-efficiency, mergeability, completeness. The current protocols, on other hand, fail achieve global optimization of communication cost. To this end, article, we propose marked cuckoo filter (MCF), structure for representing members. Grounded MCF, implement MCFsyn protocol reconcile multiple sets. aggregates distributes sets information represented MCFs along with an underlying minimum spanning tree among participants. participants then identify different elements traversing overall MCF which all union set. For identified missing elements, helps choose optimal senders fetch Comprehensive evaluations indicate that significantly outperforms alternatives terms both accuracy
منابع مشابه
An Unconditionally Secure Protocol for Multi-Party Set Intersection
Existing protocols for private set intersection are based on homomorphic public-key encryption and the technique of representing sets as polynomials in the cryptographic model. Based on the ideas of these protocols and the two-dimensional verifiable secret sharing scheme, we propose a protocol for private set intersection in the informationtheoretic model. By representing the sets as polynomial...
متن کاملA Cuckoo Filter Modification Inspired by Bloom Filter
Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...
متن کاملPrivacy-Preserving Multi-Party Reconciliation Secure in the Malicious Model
The problem of fair and privacy-preserving ordered set reconciliation arises in a variety of applications like auctions, e-voting, and appointment reconciliation. While several multi-party protocols have been proposed that solve this problem in the semi-honest model, there are no multi-party protocols that are secure in the malicious model so far. In this paper, we close this gap. Our newly pro...
متن کاملGraphene: A New Protocol for Block Propagation Using Set Reconciliation
We devise a novel method of interactive set reconciliation for efficient block distribution. Our approach, called Graphene, couples a Bloom filter with an IBLT. We evaluate performance analytically and show that Graphene blocks are always smaller. For example, while a 17.5 KB Xtreme Thinblock can be encoded in 10 KB with Compact Blocks, the same information can be encoded in 2.6 KB with Graphen...
متن کاملA Multi-party Rational Exchange Protocol
In recent years, existing computing schemes and paradigms have evolved towards more flexible, ad-hoc scalable frameworks. Nowadays, exchanging interactions between entities often takes place in nonstructured environments where the number and nature of the different participants are unknown variables. In this context, traditional fair exchange protocols cease to be a feasible solution to the exc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2021
ISSN: ['1045-9219', '1558-2183', '2161-9883']
DOI: https://doi.org/10.1109/tpds.2021.3074440